Optimizing time and convenience in group scheduling
نویسندگان
چکیده
We consider the situation in which a group of agents are trying to find an agreeable time for a meeting. Each agent’s availability is governed by a known prior probability distribution, but the realization of it is private information. The goal (of the convener) is to find an agreeable time slot while optimizing in two dimensions: Expected time to reach agreement and expected inconvenience caused during the process. We take the most common web-based tool in use today – Doodle – as the starting point. We generalize Doodle to a class of B-Doodle mechanisms (“Batched Doodle”) and study the trade-off between the Time-Inconvenience dimensions. In a B-Doodle mechanism, the convener iteratively asks agents about their availability for one or more time slots, until an agreement can be reached. Among (exponentially) many B-Doodle mechanisms, the main objective is to find a B-Doodle mechanism that minimizes the aggregate cost of Time and Inconvenience (such as a linear combination of the two). We provide an efficient algorithm that achieves this for a broad class of cost functions, and show in simulations that the result substantially outperforms Doodle in many realistic settings.
منابع مشابه
Optimizing the Static and Dynamic Scheduling problem of Automated Guided Vehicles in Container Terminals
The Minimum Cost Flow (MCF) problem is a well-known problem in the area of network optimisation. To tackle this problem, Network Simplex Algorithm (NSA) is the fastest solution method. NSA has three extensions, namely Network Simplex plus Algorithm (NSA+), Dynamic Network Simplex Algorithm (DNSA) and Dynamic Network Simplex plus Algorithm (DNSA+). The objectives of the research reported in this...
متن کاملOptimizing the preventive maintenance scheduling by genetic algorithm based on cost and reliability in National Iranian Drilling Company
The present research aims at predicting the required activities for preventive maintenance in terms of equipment optimal cost and reliability. The research sample includes all offshore drilling equipment of FATH 59 Derrick Site affiliated with National Iranian Drilling Company. Regarding the method, the research uses a field methodology and in terms of its objectives, it is classified as an app...
متن کاملBi-criteria Three Stage Fuzzy Flowshop Scheduling with Transportation Time and Job Block Criteria
Scheduling is an enduring process where the existence of real time information frequently forces the review and modification of pre-established schedules. The real world is complex and complexity generally arises from uncertainty. From this prospective the concept of fuzziness is introduced in the field of scheduling. The present paper pertains to a bi-criterion in n-jobs, three machines fl...
متن کاملSetup times optimization with considering maintenance scheduling by using nonlinear modeling
The present paper, titled “optimizing the time of preparation, taking into account the timing of repair and maintenance using non-linear modeling”, has been implemented with the aim of designing and presenting a mathematical model to get the best sequence of operations leading to minimum the total time of production. The main research question is related to the reduction of time and productio...
متن کاملSolving Group Scheduling Problem in No-wait Flow Shop with Sequence Dependent Setup Times
Different manufacturing enterprises use regularly scheduling algorithms in order to help meeting demands over time and reducing operational costs. Nowadays, for a better useofresources and manufacturingin accordance withcustomer needs and given the level ofcompetitionbetweencompanies, employing asuitablescheduling programhasa double importance. Conventional productionmethods are constantly subs...
متن کامل